Uncountable graphs and invariant measures on the set of universal countable graphs

We give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and Ksfree homogeneous universal graphs (for s ≥ 3) that are invariant with respect to the group of all permutations of the vertices. Such measures can be regarded as random graphs (respectively, random Ks-free graphs). The well-known example of Erdös–Rényi (ER) of the random graph corresponds to the Bernoulli measure on the set of adjacency matrices. For the case of the universal Ks-free graphs there were no previously known examples of the invariant measures on the space of such graphs. The main idea of our construction is based on the new notions of measurable universal, and topologically universal graphs, which are interesting themselves. The realization of the construction can be regarded as two-step randomization for universal measurable graph : ”randomization in vertices” and ”randomization in edges”. For Ksfree, s ≥ 3 there is only randomization in vertices of the measurable graphs. The completeness of our lists is proved using the important theorem by D. Aldous about S∞-invariant matrices, which we reformulate in appropriate way.